A Fast Dense Triangular Solve in CUDA
نویسندگان
چکیده
منابع مشابه
A fast triangular solve on GPUs
The level 2 BLAS operation trsv performs a dense triangular solve, and is often used in the solve phase of a direct solver following a matrix factorization. With the advent of manycore architectures the importance of this memory-bound kernel is increasingly important, particularly for sparse direct solvers used in optimization applications. In this paper, a high performance implementation of th...
متن کاملOn Parallel Solution of Sparse Triangular Linear Systems in CUDA
The acceleration of sparse matrix computations on modern many-core processors, such as the graphics processing units (GPUs), has been recognized and studied over a decade. Significant performance enhancements have been achieved for many sparse matrix computational kernels such as sparse matrix-vector products and sparse matrix-matrix products. Solving linear systems with sparse triangular struc...
متن کاملRealtime Dense Stereo Matching with Dynamic Programming in CUDA
Real-time depth extraction from stereo images is an important process in computer vision. This paper proposes a new implementation of the dynamic programming algorithm to calculate dense depth maps using the CUDA architecture achieving real-time performance with consumer graphics cards. We compare the running time of the algorithm against CPU implementation and demonstrate the scalability prope...
متن کاملdesigning a fast locking pll
a phase-locked loop (pll) based frequency synthesizer is an important circuit that is used in many applications, especially in communication systems such as ethernet receivers, disk drive read/write channels, digital mobile receivers, high-speed memory interfaces, system clock recovery and wireless communication system. other than requiring good signal purity such as low phase noise and low spu...
Fast CUDA-Based Triangulation of Molecular Surfaces
Modeling molecular surfaces enables us to extract useful information about interactions with other molecules and measurements of areas and volumes. Over the years many types of algorithms have been developed to represent and rendering molecular surfaces, but all these algorithms have problems related to time performance in triangulating molecular surfaces. One possible solution to solve this pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2013
ISSN: 1064-8275,1095-7197
DOI: 10.1137/12088358x